On K*-Ultrahomogeneous Graphs
نویسندگان
چکیده
Let C be any class of graphs. A graph G is C-ultrahomogeneous if every isomorphism between induced subgraphs belonging to C extends to an automorphism of G. We study graphs that are K∗-ultrahomogeneous, where K∗ is the class of complete graphs. We also explicitly classify the graphs that are tK∗-ultrahomogeneous, where tK∗ is the class of disjoint unions of complete graphs.
منابع مشابه
On C-ultrahomogeneous graphs and digraphs
The notion of a C-ultrahomogeneous graph, due to Isaksen et al., is adapted for digraphs and studied for the twelve cubic distance transitive graphs, with C formed by g-cycles and (k − 1)-paths, where g = girth and k = arc-transitivity. Excluding the Petersen, Heawood and Foster (90 vertices) graphs, one can go further by considering the (k− 1)-powers of g-cycles under orientation assignments p...
متن کاملOn certain C-ultrahomogeneous graphs obtained from cubic distance transitive graphs
The notion of a C-ultrahomogeneous (or C-UH) graph due to D. Isaksen et al. is adapted for digraphs and applied to the cubic distance-transitive graphs considered both as graphs and digraphs when C is formed by shortest cycles and (k − 1)-paths with k = arc-transitivity. Moreover, (k − 1)powers of shortest cycles taken with orientation assignments that make these graphs become C-UH digraphs are...
متن کاملConstructing {K2s, Tts,t}K2-Homogeneous Graphs with Pencils
Let C be a class of graphs. A restricted concept of C-homogeneous graphs generalizing the C-ultrahomogeneous graphs of [5] is given. Subsequently, a construction of non-line-graphical {K2s, Tts,t}K2 homogeneous graphs that includes the {K4, K2,2,2}K2 -ultrahomogeneous graph of [2], by means of ordered pencils of binary projective spaces, is shown to yield 20 such graphs that are not {K2s, Tts,t...
متن کاملC-Homogeneous Graphs Via Ordered Pencils
Let C be a class of graphs closed under isomorphism and let ~ C be obtained from C by arc anchorage. A concept of ~ C-homogeneous graphs that include the C-ultrahomogeneous graphs is given, with the explicit construction of ~ C-homogeneous graphs that are not C-ultrahomogeneous, via ordered pencils of binary projective spaces.
متن کاملOrienting and separating distance-transitive graphs
It is shown that exactly 7 distance-transitive cubic graphs among the existing 12 possess a particular ultrahomogeneous property with respect to oriented cycles realizing the girth that allows the construction of a related Cayley digraph with similar ultrahomogeneous properties in which those oriented cycles appear minimally ”pulled apart”, or ”separated” and whose description is truly beautifu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ars Comb.
دوره 82 شماره
صفحات -
تاریخ انتشار 2007